#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e3+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL n;cin>>n;
      vector<LL>ans1,ans2;
      for(LL i=1;i<=n;i++){
          cin>>a[i];
          if(a[i]&1) ans1.push_back(a[i]);
          else ans2.push_back(a[i]);
      }
      for(auto i:ans1){
          cout<<i<<" ";
      }
      for(auto i:ans2){
          cout<<i<<" ";
      }
      cout<<"\n";

   }
   return 0;
}
